Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors
نویسندگان
چکیده
This paper presents stable, radix-2, completely recursive discrete cosine transform algorithms DCT-I and DCT-III solely based on DCT-I, DCT-II, DCT-III, and DCT-IV having sparse and orthogonal factors. Error bounds for computing the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having sparse and orthogonal factors are addressed. Signal flow graphs are demonstrated based on the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having orthogonal factors. Finally image compression results are presented based on the recursive 2D DCT-II and DCT-IV algorithms for image size 512× 512 pixels with transfer block sizes 8× 8, 16× 16, and 32× 32 with 93.75% absence of coefficients in each transfer block.
منابع مشابه
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DSTIV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from 2N log2 N +O(N...
متن کاملMixed-radix discrete cosine transform
This note presents two new fast discrete cosine transform computation algorithms: a radix-3 and a radix-6 algorithm. These two Manuscript received November 21, 1991; revised January 4, 1993. The authors are with the Department of Electronic Engineering, Hong IEEE Log Number 921 1527. Kong Polytechnic, Hung Hom, Kowloon, Hong Kong. new algorithms are superior to the conventional radix-2 algorith...
متن کاملComments on "Fast Radix-9 Algorithm for the DCT-IV Computation"
—Recently, a fast radix-algorithm for an efficient computation of the type-IV discrete cosine transform (DCT-IV) has been proposed in [1], where is an odd positive integer. In particular, based on the proposed fast algorithm, optimized efficient 3-, 5-, and 9-point scaled DCT-IV (SDCT-IV) modules have been derived in [1]. As a response, an improved efficient optimized 9-point scaled DCT-IV (SDC...
متن کاملType-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ∼ 2N log2 N to ∼ 17 9 N log2 N for a power-of-two transform size N . Furthermore, we...
متن کاملImplementation of Efficient CORDIC Array Structure Based Fast RADIX-2 DCT Algorithm
A modern coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation DCT). The planned algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation (FFT)-like regular data flow, uniform post-scaling factor, in-place computation and arithmetic sequence rotation angles. Compared to existing DCT algorit...
متن کامل